Ela Extremal Algebraic Connectivities of Certain Caterpillar Classes and Symmetric Caterpillars∗
نویسندگان
چکیده
A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and n ≥ 6 be given. Let Pd−1 be the path of d − 1 vertices and Sp be the star of p + 1 vertices. Let p = [p1, p2, ..., pd−1] such that p1 ≥ 1, p2 ≥ 1, ..., pd−1 ≥ 1. Let C (p) be the caterpillar obtained from the stars Sp1 , Sp2 , ..., Spd−1 and the path Pd−1 by identifying the root of Spi with the i−vertex of Pd−1. Let n > 2 (d− 1) be given. Let C = {C (p) : p1 + p2 + ...+ pd−1 = n− d+ 1} and S = {C(p) ∈ C : pj = pd−j , j = 1, 2, · · · , ⌊ d− 1 2 ⌋}. In this paper, the caterpillars in C and in S having the maximum and the minimum algebraic connectivity are found. Moreover, the algebraic connectivity of a caterpillar in S as the smallest eigenvalue of a 2 × 2 block tridiagonal matrix of order 2s × 2s if d = 2s + 1 or d = 2s + 2 is characterized.
منابع مشابه
Extremal algebraic connectivities of certain caterpillar classes and symmetric caterpillars
A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and n ≥ 6 be given. Let Pd−1 be the path of d − 1 vertices and Sp be the star of p + 1 vertices. Let p = [p1, p2, ..., pd−1] such that p1 ≥ 1, p2 ≥ 1, ..., pd−1 ≥ 1. Let C (p) be the caterpillar obtained from the stars Sp1 , Sp2 , ..., Spd−1 and the path Pd−1 by identifying the root of Spi with the i...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملEla the Minimum Algebraic Connectivity of Caterpillar Unicyclic Graphs
A caterpillar unicyclic graph is a unicyclic graph in which the removal of all pendant vertices makes it a cycle. In this paper, the unique caterpillar unicyclic graph with minimum algebraic connectivity among all caterpillar unicyclic graphs is determined.
متن کاملSnakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کامل